Rapid Selection of Services based on QoS

Modularity takes many forms depending on the programming paradigm. We focus on Service Oriented Architecture (SOA), where the primary module unit is a service. Service selection is a key part of SOA, and it is primarily done based on function; but Quality of Service (QoS) is rapidly gaining importance. Existing dynamic service selection approaches recompute the request each time which may be unnecessary. If the same service is chosen as having the “best” QoS for various selections, then that service may end with too much load. We propose the FASICA (FAst service selection for SImilar constraints with CAche) Framework which chooses a service with satisfactory QoS as quickly as possible. The key points are (1) to use a cache which stores previous search results, (2) to use K-Nearest Neighbor (K-NN) algorithm with K-d tree when a satisfactory service does not exist in the cache, and (3) to distribute the service request according to a distribution policy. The results of a simulation show that our approach can rapidly select a service compared to a conventional approach.